Non-Definability of the Class of Complete Bundled Trees
نویسندگان
چکیده
منابع مشابه
From Linear to Branching-Time Temporal Logics: Transfer of Semantics and Definability
This paper investigates logical aspects of combining linear orders as semantics for modal and temporal logics, with modalities for possible paths, resulting in a variety of branching time logics over classes of trees. Here we adopt a unified approach to the Priorean, Peircean and Ockhamist semantics for branching time logics, by considering them all as fragments of the latter, obtained as combi...
متن کاملSaturation, Definability, and Separation for XPath on Data Trees
We study the expressive power of some fragments of XPath equipped with (in)equality tests over data trees. Our main results are the definability theorems, which give necessary and sufficient conditions under which a class of data trees can be defined by a node expression or set of node expressions, and our separation theorems, which give sufficient conditions under which two disjoint classes of...
متن کاملChanges of phenolic compounds and non-structural carbohydrates on alternate bearing cycle in ‘Kinnow’ mandarin trees
In this study we have demonstrated the variations of carbohydrates and phenolic compounds present in the leaves and stems of ‘Kinnow’ mandarin (Citrus reticulata Blanco) trees in alternate bearing cycle and the possible involvement of these compounds to flower bud formation process. The amounts of these compounds were determined in the leaves and stems of “on” and “off” trees monthly from Nov...
متن کاملLogical Definability and Query Languages over Unranked Trees
Unranked trees, that is, trees with no restriction on the number of children of nodes, have recently attracted much attention, primarily as an abstraction of XML documents. In this paper, we study logical definability over unranked trees, as well as collections of unranked trees, that can be viewed as databases of XML documents. The traditional approach to definability is to view each tree as a...
متن کاملAxiomatization of a Branching Time Logic with Indistinguishability Relations
Trees with indistinguishability relations provide a semantics for a temporal language “composed by” the Peircean tense operators and the Ockhamist modal operator. In this paper, a finite axiomatization with a non standard rule for this language interpreted over bundled trees with indistinguishability relations is given. This axiomatization is proved to be sound and strongly complete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Logic Journal of the IGPL
دوره 7 شماره
صفحات -
تاریخ انتشار 1999